Chatbot Cerdas Sebagai Helpdesk Objek Wisata Menggunakan Algoritma Smith-Waterman
نویسندگان
چکیده
Wisata pantai pasir putih delegan Gresik, Jawa Timur memiliki banyak objek wisata yang ada di dalamnya. Namun hal tersebut mempunyai pelayanan kurang bagus dalam penyampaian informasi tentang wisata, karena tidak adanya sistem bisa membantu pencarian akurat. Oleh itu Peneliti membuat sebuah aplikasi chatbot cerdas dibangun menggunakan metode Smith-Waterman. Metode akan digunakan untuk menentukan kemiripan teks dari keyword kata di-input-kan oleh user sebelumnya telah dilakukan proses pre-processing terlebih dahulu, dan menampilkan output jawaban sesuai dengan pertanyaan diajukan. Penerapan algoritma Smith-Waterman bertujuan memperoleh lebih akurat guna memudahkan pengunjung mendapatkan informasi. Dari hasil pengujian dilakukan, smith-waterman nilai akurasi sebesar 84,375% dibuat langsung diuji pada minimal similarity 60. Penentuan batas format sangat berpengaruh terhadap peningkatan chat ini bekerja menghitung kalimatnya per karakter atau huruf, jadi sequence urutan diperhatikan.
منابع مشابه
Validasi data dengan menggunakan objek lookup pada borland delphi 7.0
s: Developing an application with some tables must concern the validation of input (scpecially in Table Child). In order to maximize the accuracy and input data validation. Its called lookup (took data from other dataset). There are 2 (two) ways to lookup data from Table Parent: 1) Using Objects (DBLookupComboBox & DBLookupListBox), or 2) Arranging The Properties Of Fields Data Type (shown by u...
متن کاملGPU Accelerated Smith-Waterman
We present a novel hardware implementation of the double affine Smith-Waterman (DASW) algorithm, which uses dynamic programming to compare and align genomic sequences such as DNA and proteins. We implement DASW on a commodity graphics card, taking advantage of the general purpose programmability of the graphics processing unit to leverage its cheap parallel processing power. The results demonst...
متن کاملOptimizing Smith-Waterman Alignments
Mutual correlation between segments of DNA or protein sequences can be detected by Smith-Waterman local alignments. We present a statistical analysis of alignment of such sequences, based on a recent scaling theory. A new fidelity measure is introduced and shown to capture the significance of the local alignment, i.e., the extent to which the correlated subsequences are correctly identified. It...
متن کاملA Smith-Waterman Systolic Cell
With an aim to understand the information encoded by DNA sequences, databases containing large amount of DNA sequence information are frequently compared and searched for matching or near-matching patterns. This kind of similarity calculation is known as sequence alignment. To date, the most popular algorithms for this operation are heuristic approaches such as BLAST and FASTA which give high s...
متن کاملParallel Smith-Waterman Algorithm for Gene Sequencing
Smith-Waterman Algorithm represents a highly robust and efficient parallel computing system development for biological gene sequence. The research work here gives a deep understanding and knowledge transfer about exiting approach for gene sequencing and alignment using Smith-waterman their strength and weaknesses. Smith-Waterman algorithm calculates the local alignment of two given sequences us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: J-TIT : Jurnal Teknologi Informasi dan Terapan
سال: 2023
ISSN: ['2580-2291', '2354-838X']
DOI: https://doi.org/10.25047/jtit.v10i1.312